Comparing Hagino's categorical programming language and typed lambda-calculi
نویسندگان
چکیده
منابع مشابه
Programming in higher-order typed lambda-calculi
Typed A-calculi have been objects of theoretical study for many years. Recently, it has been shown that all the inductively defined types (including numbers, booleans, lists, and trees, as well as more complex structures like typed terms and proofs) can be represented in higher-order A-calculi with no built-in types or type constructors. This raises the possibility of designing practical progra...
متن کاملLNCS 7941 - Typed Lambda Calculi and Applications
We summarize some recent results showing how the lambdacalculus may be obtained by considering the metric completion (with respect to a suitable notion of distance) of a space of affine lambda-terms, i.e., lambda-terms in which abstractions bind variables appearing at most once. This formalizes the intuitive idea that multiplicative additive linear logic is “dense” in full linear logic (in fact...
متن کاملTyped lambda calculi and possible worlds models
Course overview (current plan; adjustable) i. Typed lambda calculi and possible worlds models ii. Alternative approaches to meaning iii. Grounded language understanding iv. Question answering: Grounding in databases v. Stochastic lambda calculus vi. Distributional approaches to word meanings vii. Composition in vector-space models 1: tensors viii. Composition in vector-space models 2: recursive...
متن کاملCategorical Models for Simply Typed Resource Calculi
We introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely’s differential Cartesian categories. We prove that differential λ-categories can be used to model the simply typed versions of: (i) the differential λ-calculus, a λ-calculus extended with a syntactic derivative operator; (ii) the resource calculus, a non-lazy axiomatisation of Boudol’s λ-calculus with mult...
متن کاملContinuation Semantics in Typed Lambda-Calculi (Summary)
1. Abstract. This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90186-w